An Efficient Rule-Hiding Method for Privacy Preserving in Transactional Databases
نویسندگان
چکیده
منابع مشابه
An Efficient Approximate Protocol for Privacy-Preserving Association Rule Mining
The secure scalar product (or dot product) is one of the most used sub-protocols in privacy-preserving data mining. Indeed, the dot product is probably the most common sub-protocol used. As such, a lot of attention has been focused on coming up with secure protocols for computing it. However, an inherent problem with these protocols is the extremely high computation cost – especially when the d...
متن کاملAn Efficient Algorithm for Classification Rule Hiding
Data mining is the extraction of the hidden information from large databases. It is a powerful technology with new great potential to analyze important information in the data warehouse.
متن کاملExploring efficient privacy preserving technique for association rule data mining
Databases of operational and customer activity are a critical resource for an organization not only to support business processes but also for use in strategic planning. The databases are analyzed within an organization and shared with trading partners to improve efficiency and direct marketing efforts. The frequent item set hiding problem is an area of active research to study approaches for h...
متن کاملA Parallelization Framework for Exact Knowledge Hiding in Transactional Databases
The hiding of sensitive knowledge, mined from transactional databases, is one of the primary goals of privacy preserving data mining. The increased storage capabilities of modern databases and the necessity for hiding solutions of superior quality, paved the way for parallelization of the hiding process. In this paper, we introduce a novel framework for decomposition and parallel solving of a c...
متن کاملAn efficient nonstandard numerical method with positivity preserving property
Classical explicit finite difference schemes are unsuitable for the solution of the famous Black-Scholes partial differential equation, since they impose severe restrictions on the time step. Furthermore, they may produce spurious oscillations in the solution. We propose a new scheme that is free of spurious oscillations and guarantees the positivity of the solution for arbitrary stepsizes. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2018
ISSN: 1330-1136,1846-3908
DOI: 10.20532/cit.2017.1003680